Exploiting Causality for Selective Belief Filtering in Dynamic Bayesian Networks (Extended Abstract)
نویسندگان
چکیده
Dynamic Bayesian networks (DBNs) are a general model for stochastic processes with partially observed states. Belief filtering in DBNs is the task of inferring the belief state (i.e. the probability distribution over process states) based on incomplete and uncertain observations. In this article, we explore the idea of accelerating the filtering task by automatically exploiting causality in the process. We consider a specific type of causal relation, called passivity, which pertains to how state variables cause changes in other variables. We present the Passivitybased Selective Belief Filtering (PSBF) method, which maintains a factored belief representation and exploits passivity to perform selective updates over the belief factors. PSBF is evaluated in both synthetic processes and a simulated multi-robot warehouse, where it outperformed alternative filtering methods by exploiting passivity.
منابع مشابه
Exploiting Causality for Selective Belief Filtering in Dynamic Bayesian Networks
Dynamic Bayesian networks (DBNs) are a general model for stochastic processes with partially observed states. Belief filtering in DBNs is the task of inferring the belief state (i.e. the probability distribution over process states) based on incomplete and uncertain observations. In this article, we explore the idea of accelerating the filtering task by automatically exploiting causality in the...
متن کاملBelief Network Algorithms: a Study of Performance Using Domain Characterisation
Extended Abstract In this abstract we give an overview of the work described in 15]. Belief networks provide a graphical representation of causal relationships together with a mechanism for probabilistic inference, allowing belief updating based on incomplete and dynamic information. We present a survey of Belief Network belief updating algorithms and propose a domain characterisation system wh...
متن کاملExploiting Locality in Probabilistic Inference
Exploiting Locality in Probabilistic Inference by Mark Andrew Paskin Doctor of Philosophy in Computer Science University of California, Berkeley Professor Stuart J. Russell, Chair This thesis investigates computational properties of decomposable probability models, which can be represented in terms of marginals over subsets of variables. We show that decomposable representations have significan...
متن کاملA Structurally and Temporally Extended Bayesian Belief Network Model: Definitions, Properties, and Modeling Techniques
We developed the language of Modifiable Temporal Belief Networks (MTBNs) as a structural and temporal extension of Bayesian Belief Networks (BNs) to facilitate normative temporal and causal modeling under uncertainty. In this paper we present definitions of the model, its components, and its fundamental properties. We also discuss how to represent various types of temporal knowledge, with an em...
متن کاملThe Computational Power of Dynamic Bayesian Networks
This paper considers the computational power of constant size, dynamic Bayesian networks. Although discrete dynamic Bayesian networks are no more powerful than hidden Markov models, dynamic Bayesian networks with continuous random variables and discrete children of continuous parents are capable of performing Turing-complete computation. With modified versions of existing algorithms for belief ...
متن کامل